\begin{thebibliography}{8}
\raggedright

\bibitem{grasp}
	Feo, Thomas A., Resende. Mauricio G. C. \emph{Greedy randomized adaptive search procedures.} Journal
	of Global Optimization (1995), pp. 1–27.

\bibitem{greedyset}
	Chvatal, V., \emph{A Greedy Heuristic for the Set-Covering Problem}. Mathematics of Operations Research Vol. 4, No. 3 (Aug., 1979), pp. 233-235
	URL: \url{http://www.jstor.org/stable/3689577}

\bibitem{cppfind}
	C++ Reference, \emph{Funci\'on algorithm::find}, \\
	URL: \url{http://cplusplus.com/reference/algorithm/find/}

\bibitem{cpppq}
	C++ Reference, \emph{Clase queue::priority\_queue}, \\
	URL: \url{http://cplusplus.com/reference/stl/priority_queue/}

\bibitem{cppmh}
	C++ Reference, \emph{Funci\'on algorithm::make\_heap}, \\
	URL: \url{http://cplusplus.com/reference/algorithm/make_heap/}

\bibitem{cppph}
	C++ Reference, \emph{Funci\'on algorithm::pop\_heap}, \\
	URL: \url{http://cplusplus.com/reference/algorithm/pop_heap/}

\bibitem{gridgraphs}
	Alanko S. , Crevals S. , Isopoussu A. , Ostergard P., Petterson V., \emph{Computing the Domination Number of Grid Graphs.}.
	The Electronic Journal of Combinatorics Vol. 18 (2011), pp. 141. URL: \url{http://www1.combinatorics.org/Volume_18/PDF/v18i1p141.pdf}


\end{thebibliography}
